Search results for " forbidden"
showing 10 items of 11 documents
A Characterization of Bispecial Sturmian Words
2012
A finite Sturmian word w over the alphabet {a,b} is left special (resp. right special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial Sturmian word is a Sturmian word that is both left and right special. We show as a main result that bispecial Sturmian words are exactly the maximal internal factors of Christoffel words, that are words coding the digital approximations of segments in the Euclidean plane. This result is an extension of the known relation between central words and primitive Christoffel words. Our characterization allows us to give an enumerative formula for bispecial Sturmian words. We also investigate the minimal forbidden words for the set of Sturmian wo…
Still Going “Grey” After All These Years? Export Restraint Agreements and the WTO
2013
This chapter assesses how the dual strategy that aimed to eliminate "grey area" measures has worked out in practice, also in the light of the protectionist pressures unleashed by the current economic crisis. After providing a brief overview of the historic proliferation of these measures, it discusses whether the attempt to render ordinary safeguard measures a more attractive alternative to voluntary restraint agreements (VRAs) has worked in practice. The chapter analyses some of the intrinsic and extrinsic weaknesses of the ban itself. The chapter reviews some cases of export-restraint agreements arguably falling within the exceptions to the ban enshrined in Art. 11.1.C. This work has exam…
Cyclic Complexity of Words
2014
We introduce and study a complexity function on words $c_x(n),$ called \emph{cyclic complexity}, which counts the number of conjugacy classes of factors of length $n$ of an infinite word $x.$ We extend the well-known Morse-Hedlund theorem to the setting of cyclic complexity by showing that a word is ultimately periodic if and only if it has bounded cyclic complexity. Unlike most complexity functions, cyclic complexity distinguishes between Sturmian words of different slopes. We prove that if $x$ is a Sturmian word and $y$ is a word having the same cyclic complexity of $x,$ then up to renaming letters, $x$ and $y$ have the same set of factors. In particular, $y$ is also Sturmian of slope equ…
On the Structure of Bispecial Sturmian Words
2013
A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words. A Sturmian word is bispecial if it can be extended to the left and to the right with both letters remaining a Sturmian word. There is a deep relation between bispecial Sturmian words and Christoffel words, that are the digital approximations of Euclidean segments in the plane. In 1997, J. Berstel and A. de Luca proved that \emph{palindromic} bispecial Sturmian words are precisely the maximal internal factors of \emph{primitive} Christoffel words. We extend this result by showing that bispecial Sturmian wo…
Minimal forbidden factors of circular words
2017
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist algorithms for computing the minimal forbidden factors of a word, as well as of a regular factorial language. Conversely, Crochemore et al. [IPL, 1998] gave an algorithm that, given the trie recognizing a finite antifactorial language $M$, computes a DFA recognizing the language whose set of minimal forbidden factors is $M$. In the same paper, they showed that the obtained DFA is minimal if the input trie recognizes the minimal forbidden factors of a single word.…
Word assembly through minimal forbidden words
2006
AbstractWe give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of constant size starting from a finite set of factors of w verifying a suitable hypothesis. We use combinatorics techniques based on the minimal forbidden words, which have been introduced in previous papers. This improves a previous algorithm which worked under the assumption of stronger hypothesis.
Minimal Forbidden Factors of Circular Words
2017
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist algorithms for computing the minimal forbidden factors of a word, as well as of a regular factorial language. Conversely, Crochemore et al.ÃÂ [IPL, 1998] gave an algorithm that, given the trie recognizing a finite antifactorial language M, computes a DFA of the language having M as set of minimal forbidden factors. In the same paper, they showed that the obtained DFA is minimal if the input trie recognizes the minimal forbidden factors of a single word. We gener…
Spin-dipole nuclear matrix elements for double beta decays and astro-neutrinos
2014
Spin-dipole (SD) nuclear matrix elements (NMEs) M±(SD2) for unique first forbidden β±2−→0+ ground-state-to-ground-state transitions are studied by using effective microscopic two-nucleon interactions in realistic single-particle model spaces. The observed values of the NMEs Mexp±(SD2) are compared with the values of the single-quasiparticle NMEs Mqp±(SD2) without nucleon spin–isospin (στ) correlation and the QRPA NMEs MQRPA±(SD2) with the στ correlation. The observed SD matrix elements are found to be reduced by the factor k≈0.2 with respect to Mqp±(SD2) and by the factor kNM≈0.5 with respect to MQRPA±(SD2). We then infer that the SD NME is reduced considerably partly by the nucleon στ corr…
Searches for rare or forbidden semileptonic charm decays
2011
We present searches for rare or forbidden charm decays of the form $X_c^+\to h^\pm\ell^\mp\ell^{(\prime)+}$, where $X_c^+$ is a charm hadron ($D^+$, $D^+_s$, or $\Lambda_c^+$), $h^\pm$ is a pion, kaon, or proton, and $\ell^{(\prime)\pm}$ is an electron or muon. The analysis is based on $384 fb^{-1}$ of $e^+e^-$ annihilation data collected at or close to the $\Upsilon(4S)$ resonance with the BaBar detector at the SLAC National Accelerator Laboratory. No significant signal is observed for any of the 35 decay modes that are investigated. We establish 90% confidence-level upper limits on the branching fractions between $1 \times 10^{-6}$ and $44 \times 10^{-6}$ depending on the channel. In most…
"Una coppia di serpenti allacciati". L'incesto nelle "Benevole" di Jonathan Littell
2020
The article reads the novel "The Kindly Ones" (2006) by French author Jonathan Littell and focuses on the issue of incest displayed in the plot.